Maximally equidistributed combined Tausworthe generators

نویسنده

  • Pierre L'Ecuyer
چکیده

Tausworthe random number generators based on a primitive trinomial allow an easy and fast implementation when their parameters obey certain restrictions. However, such generators, with those restrictions, have bad statistical properties unless we combine them. A generator is called maximally equidistributed if its vectors of successive values have the best possible equidistribution in all dimensions. This paper shows how to find maximally equidistributed combinations in an efficient manner, and gives a list of generators with that property. Such generators have a strong theoretical support and lend themselves to very fast software implementations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tables of maximally equidistributed combined LFSR generators

We give the results of a computer search for maximally equidistributed combined linear feedback shift register (or Tausworthe) random number generators, whose components are trinomials of degrees slightly less than 32 or 64. These generators are fast and have good statistical properties.

متن کامل

Maximally Equidistributed Decimated GFSR Generators

This paper presents generators based on decimated sequences of Generalized Feedback Shift Register (GFSR) generators. The equivalence relation between decimated GFSR generators and Tausworthe generators are presented and a k-distributed initialization scheme is derived. We present decimated GFSR generators that are maximally equidistributed. Timing results of these generators are presented.

متن کامل

Construction of Equidistributed Generators Based on Linear Recurrences Modulo 2

Random number generators based on linear recurrences modulo 2 are widely used and appear in different forms, such as the simple and combined Tausworthe generators, the GFSR, and the twisted GFSR generators. Low-discrepancy point sets for quasi-Monte Carlo integration can also be constructed based on these linear recurrences. The quality of these generators or point sets is usually measured by c...

متن کامل

34.1. Sampling the Uniform Distribution 34.2. Inverse Transform Method

Monte Carlo techniques are often the only practical way to evaluate difficult integrals or to sample random variables governed by complicated probability density functions. Here we describe an assortment of methods for sampling some commonly occurring probability density functions. Most Monte Carlo sampling or integration techniques assume a " random number generator, " which generates uniform ...

متن کامل

37.1. Sampling the Uniform Distribution 37.2. Inverse Transform Method

Monte Carlo techniques are often the only practical way to evaluate difficult integrals or to sample random variables governed by complicated probability density functions. Here we describe an assortment of methods for sampling some commonly occurring probability density functions. Most Monte Carlo sampling or integration techniques assume a " random number generator, " which generates uniform ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 65  شماره 

صفحات  -

تاریخ انتشار 1996